Subroutine for generating all permutations of N integers
نویسندگان
چکیده
منابع مشابه
Generating random alternating permutations in time n log n
We introduce an algorithm generating uniformly distributed random alternating permutations of length n in time n log n. 1 The main result An alternating permutation σ of {1, 2, . . . N} is a permutation such that σ(1) > σ(2) < σ(3) > σ(4) . . . Alternating permutations are a very classical topic in combinatorics. See for instance the surveys [KPP, ST] for numerous references and the link with i...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملArithmetical Properties of Permutations of Integers
For the finite case let a1 , a 2 , . . ., an be a permutation of the integers 1, 2, . . ., n and for the infinite case let a 1 , a2 , . . ., ai , . . . be a permutation of all positive integers . Some problems and results concerning such permutations and related questions can be found in [2] (see in particular p. 94). In [3] the density of the sums ai+ai +1 is estimated from several points of v...
متن کاملThe Anatomy of Integers and Permutations
If you switch on your TV in the evening then, as likely as not, you will find yourself watching an episode of a popular detective show (set in various spectacular locations) in which surprisingly dapper forensic scientists turn up evidence using careful anatomical (and other) study so as to be able to identify and prosecute a heinous criminal. Sometimes a flatfooted detective is misled by the s...
متن کاملGenerating SIMD Vectorized Permutations
This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These permutations are crucial for highperformance numerical kernels including the fast Fourier transform. Our generator takes as input only the specification of the target platform’s SIMD vector ISA and the desired permutation. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods & Instrumentation
سال: 1975
ISSN: 1554-351X,1554-3528
DOI: 10.3758/bf03201295